Learning Pomset Automata
نویسندگان
چکیده
Abstract We extend the $$\mathtt {L}^{\!\star }$$ L⋆ algorithm to learn bimonoids recognising pomset languages. then identify a class of automata that accepts precisely languages recognised by and show how convert between automata.
منابع مشابه
Pomset mcfgs
This paper identifies two orthogonal dimensions of context sensitivity, the first being context sensitivity in concurrency and the second being structural context sensitivity. We present an example from natural language which seems to require both types of context sensitivity, and introduce partially ordered multisets (pomsets) mcfgs as a formalism which succintly expresses both.
متن کاملLearning Automata
Received 17 Revised Cellular learning automata is a combination of learning automata and cellular automata. 19 This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning 21 automata which can interact together. In some applications such as image processing, a type of cellular learn...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کاملRecognizability of Pomset Languages with Event Reenement
In the present paper, we contribute to the theory of recognizable pom-set (or partial word) languages from an algebraic point of view. By substitutions in pomsets labelled with variables and pomset contexts, we deene the syntactic equivalence of a pomset language, and use nite index ones to deene recognizable languages. We show that the induced recognizable pomset languages have extended closur...
متن کاملPomset Languages of Finite Step Transition Systems
Context Subsets of nitely generated free monoids [Kleene][Büchi].. : MSO denability ⇔ algebraic recognizability ⇔ nite device acceptance ⇔ rational expressions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-71995-1_26